On the least singular value of random symmetric matrices
نویسنده
چکیده
Let Fn be an n by n symmetric matrix whose entries are bounded by n γ for some γ > 0. Consider a randomly perturbed matrix Mn = Fn +Xn, where Xn is a random symmetric matrix whose upper diagonal entries xij , 1 ≤ i ≤ j, are iid copies of a random variable ξ. Under a very general assumption on ξ, we show that for any B > 0 there exists A > 0 such that P(σn(Mn) ≤ n−A) ≤ n−B .
منابع مشابه
Properties of Central Symmetric X-Form Matrices
In this paper we introduce a special form of symmetric matrices that is called central symmetric $X$-form matrix and study some properties, the inverse eigenvalue problem and inverse singular value problem for these matrices.
متن کاملMore about measures and Jacobians of singular random matrices
In this work are studied the Jacobians of certain singular transformations and the corresponding measures which support the jacobian computations.
متن کاملTRIANGULAR FUZZY MATRICES
In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...
متن کاملSingular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملEstimating a Few Extreme Singular Values and Vectors for Large-Scale Matrices in Tensor Train Format
We propose new algorithms for singular value decomposition (SVD) of very large-scale matrices based on a low-rank tensor approximation technique called the tensor train (TT) format. The proposed algorithms can compute several dominant singular values and corresponding singular vectors for large-scale structured matrices given in a TT format. The computational complexity of the proposed methods ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012